Higher Order Refinement Heuristics for Rule Validation
نویسنده
چکیده
For rule validation there are no second and higher order refinement heuristics yet. This paper presents an example for second order refinement heuristics and introduces generic higher order refinement heuristics. It is proposed that rule refinement should be performed case-based, i.e. the whole spectrum from first order to higher order refinement heuristics can be processed instead of first order ones only. This approach extends the classical SEEK2 framework. Moreover, the generalization specialization dichotomy is extended by defining context refinement as the third refinement class. It is shown that the system SEEK2 registers context refinement problems inadequate and that first order heuristics are suboptimal.
منابع مشابه
Inverted Heuristics in Subgroup Discovery
In rule learning, rules are typically induced in two phases, rule refinement and rule selection. It was recently argued that the usage of two separate heuristics for each phase—in particular using the so-called inverted heuristic in the refinement phase—produces longer rules with comparable classification accuracy. In this paper we test the utility of inverted heuristics in the context of subgr...
متن کاملAnalysis of Rule Refinement Conflicts
There exists no methodical standard for conflict analysis in the selection of optimal rule refinements. Current rule base refinement systems select the best rule refinements out of a set of competing ones by using heuristics rather than exact optimization procedures. In order to come up with an Operations Research approach to the optimal refinement of rule bases, an analysis of rule refinement ...
متن کاملRefinement and selection heuristics in subgroup discovery and classification rule learning
Classification rules and rules describing interesting subgroups are important components of descriptive machine learning. Rule learning algorithms typically proceed in two phases: rule refinement selects conditions for specializing the rule, and rule selection selects the final rule among several rule candidates. While most conventional algorithms use the same heuristic for guiding both phases,...
متن کاملThe Rule Retranslation Problem and the Validation Interface
Current rule base maintenance is wasting refinement and inference performance. There are only few maintenance concepts, which enjoy both (1) formal rule refinement and (2) utilizing topical knowledge provided by experts within the refinement process. The current state of the art in rule base validation and refinement reveals that there is no generic validation interface and no optimal rule trac...
متن کاملA fuzzy theory refinement algorithm 1
A fuzzy theory refinement algorithm composed of a heuristic process of generalization, specification, addition and elimination of rules is proposed. This refinement algorithm can be applied to knowledge bases obtained from several sources (learning algorithms, experts), but its development is strongly associated with the SLAVE learning system. SLAVE was developed for working with noise-affected...
متن کامل